A Shuffled Frog-Leaping Algorithm with Cooperations for Distributed Assembly Hybrid-Flow Shop Scheduling with Factory Eligibility
نویسندگان
چکیده
The distributed assembly scheduling problem with a hybrid-flow shop for fabrication is seldom studied, and some real-life constraints such as factory eligibility are handled. In this study, shop-scheduling (DAHFSP) investigated, which has symmetries on machines. A shuffled frog-leaping algorithm cooperations (CSFLA) applied to minimize makespan. problem-related feature used. Memeplexes evaluated, group 1, the two best memeplexes, 2, worst formed. new cooperation between memeplexes an adaptive search strategy implemented in groups 1 respectively. An 2 also given. Population shuffling executed every T generations. number of computational experiments conducted. Computational results demonstrate that strategies effective CSFLA very competitive DAHFSP eligibility.
منابع مشابه
A multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation
Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...
متن کاملAn effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem
This paper presents an effective shuffled frogleaping algorithm (SFLA) for solving a lot-streaming flow shop scheduling problem with equal-size sublots, where a criterion is to minimize maximum completion time (i.e., makespan) under both an idling and no-idling production cases. Unlike the original SFLA, the proposed SFLA represents an individual or frog as a job permutation and utilizes a posi...
متن کاملAn Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem
The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence to design the strategy of local searching and an extremal optimization in information exchange. The computational result shows that the propos...
متن کاملShuffled frog leaping algorithm approach to employee timetabling and job shop scheduling
In manufacturing systems, generally employee timetabling and job shop scheduling is considered to be too hard and complex. To achieve an integrated manufacturing environment, the integration of employee timetabling and job shop scheduling is essential. It is a process of assigning employees into work slots in a pattern according to the hierarchy level of the employee, job allotment, individual ...
متن کاملCentroid Mutation Embedded Shuffled Frog-Leaping Algorithm
Stochastic search algorithms that take their inspiration from nature are gaining a great attention of many researchers to solve high dimension and non – linear complex optimization problems for which traditional methods fails. Shuffled frog – leaping algorithm (SFLA) is recent addition to the family of stochastic search algorithms that take its inspiration from the foraging process of frogs. SF...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2023
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym15040786